Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution
نویسندگان
چکیده
منابع مشابه
Fault-Tolerant Aggregation by Flow Updating
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed applications. In the particular case of wireless sensor networks, data collection is often only practicable if aggregation is performed. Several aggregation algorithms have been proposed in the last few years, exhibiti...
متن کاملFlow updating: Fault-tolerant aggregation for dynamic networks
Data aggregation is a fundamental building block of modern distributed systems. Averaging based approaches, commonly designated gossip-based, are an important class of aggregation algorithms as they allow all nodes to produce a result, converge to any required accuracy, and work independently from the network topology. However, existing approaches exhibit many dependability issues when used in ...
متن کاملPractical Fault-Tolerant Data Aggregation
During Financial Cryptography 2012 Chan et al. presented a novel privacy-protection fault-tolerant data aggregation protocol. Comparing to previous work, their scheme guaranteed provable privacy of individuals and could work even if some number of users refused to participate. In our paper we demonstrate that despite its merits, their method provides unacceptably low accuracy of aggregated data...
متن کاملFault-Tolerant Data Aggregation in Wireless Sensor Networks
Accurate information is most important in Wireless Sensor Networks (WSNs). Incorrect (faulty data) information makes wrong decision; it decreases the reliability in communication. Fault tolerance is one of the issues in WSNs .Proposed fault tolerant data aggregation scheme for identifying the faulty data sent by the sensors to the cluster head, where the aggregation is performed. Identified fau...
متن کاملUsing Less Links to Improve Fault-Tolerant Aggregation
Data aggregation1 plays a basal role in the design of scalable distributed applications [1], allowing the determination of meaningful system-wide properties to direct the execution of the system. For instance, aggregation can be used to estimate: the size of the network to dimension of Distributed Hash Table (DHT) structures [2], or to set a quorum in dynamic settings [3]; the average system lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2016
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-016-0288-5